Boolean circuit - PDFSEARCH.IO - Document Search Engine

Boolean circuit
Results: 103

#	Item
21	Bent Function Synthesis by Means of Cartesian Genetic Programming Radek Hrbacek and Vaclav Dvorak Brno University of Technology, Faculty of Information Technology Bozetechova 2, 61266 Brno, Czech republic Add to Reading List Source URL: www.genetic-programming.org Language: English - Date: 2014-07-05 17:13:53 Mathematical optimization Evolutionary algorithms Genetic algorithms Bent function Boolean function Balanced boolean function Digital electronics Genetic programming Circuit Boolean algebra Mathematics Cryptography
22	Boolean Formula-based Branch Prediction for Future Technologies Daniel A. Jim´enez Dept. of Computer Sciences The University of Texas at Austin Austin, TX 78712 Add to Reading List Source URL: research.ac.upc.edu Language: English - Date: 2002-03-20 08:47:57 Branch predictor Boolean algebra Alpha 21264 CPU cache Branch misprediction Lookup table Boolean function Boolean circuit Computing Computer architecture Computer hardware
23	ICS 1F — Winter 1998 — Midterm Name: Student ID: Add to Reading List Source URL: www.ics.uci.edu Language: English - Date: 1998-02-10 16:51:49 Mathematical logic Propositional calculus Semantics Digital circuits Binary arithmetic Binary numeral system Boolean circuit Truth table FO Mathematics Boolean algebra Theoretical computer science
24	Small, Stupid, and Scalable: Secure Computing with Faerieplay∗ Alexander Iliev Sean W. Smith Add to Reading List Source URL: www.cs.dartmouth.edu Language: English - Date: 2010-11-08 12:53:14 Secure multi-party computation Circuit complexity Circuit Lookup table Boolean circuit Advantage Randomized algorithm Blinding Field-programmable gate array Theoretical computer science Applied mathematics Computational complexity theory
25	Faster Secure Two-Party Computation Using Garbled Circuits Yan Huang David Evans University of Virginia Add to Reading List Source URL: www.usenix.org Language: English - Date: 2011-06-09 13:31:32 Computational complexity theory Logic gates Circuit complexity Secure multi-party computation Levenshtein distance XOR gate Boolean circuit Circuit Adder Theoretical computer science Applied mathematics Cryptographic protocols
26	The Circuit-Input Game, Natural Proofs, and Testing Circuits With Data∗ Brynmor Chapman† Stanford University Add to Reading List Source URL: web.stanford.edu Language: English - Date: 2014-12-10 16:56:25 Complexity classes Circuit complexity Pseudorandomness Computability theory Advice Pseudorandom generator ACC0 Natural proof Boolean circuit Theoretical computer science Computational complexity theory Applied mathematics
27	Computing on Encrypted Data Secure Internet of Things Seminar David Wu January, 2015 New Applications in the Internet of Things Add to Reading List Source URL: iot.stanford.edu Language: English - Date: 2015-01-12 23:28:56 Secure multi-party computation Homomorphic encryption Computational complexity theory Computing Boolean circuit Circuit Mathematics Verifiable computing Secure two-party computation Cryptographic protocols Cryptography Applied mathematics
28	CS109B Notes for LectureGates No, not Bill \| we mean a circuit element that implements a logical function. Gate inputs and outputs are usually voltages. Add to Reading List Source URL: infolab.stanford.edu Language: English - Date: 2008-09-19 00:59:15 Logic gates Mathematics Boolean algebra Semantics Truth table Sequential logic Circuit Logical connective Flip-flop Theoretical computer science Digital electronics Electronic engineering
29	A Probabilistic Boolean Logic and its Meaning Lakshmi N. B. Chakrapani , Krishna V. Palem* Department of Computer Science Rice University Houston, Texas, USA {chakra,palem}@rice.edu Add to Reading List Source URL: www.ece.rice.edu Language: English - Date: 2012-08-15 22:05:33 Boolean algebra Probabilistic logic PP Probability interpretations Probability Propositional calculus IP Boolean circuit FO Theoretical computer science Mathematical logic Mathematics
30	Chicago Journal of Theoretical Computer Science The MIT Press Volume 1999, Article 5 Complexity of Problems on Graphs Represented as OBDDs Add to Reading List Source URL: cjtcs.cs.uchicago.edu Language: English - Date: 1999-10-12 16:14:35 Boolean algebra Complexity classes Logic in computer science Binary decision diagram Model checking Boolean function Boolean circuit Circuit FO Theoretical computer science Mathematics Computational complexity theory

UPDATE